# 给定一个数组 nums，编写一个函数将所有 0 移动到数组的末尾，同时保持非零元素的相对顺序。
#
# 示例:
#
# 输入: [0,1,0,3,12]
# 输出: [1,3,12,0,0]
# 说明:
#
# 必须在原数组上操作，不能拷贝额外的数组。
# 尽量减少操作次数。


# def moveZeroes(nums):
#     """
#     Do not return anything, modify nums in-place instead.
#     """
#     i = 0
#     length = len(nums)
#     zero_num = 0
#     while i < length:
#         if nums[i] == 0:
#             nums.pop(i)
#             zero_num += 1
#             length -= 1
#             continue
#         i += 1
#     nums += [0] * zero_num
#
#
# nums = [0,0,1]
# moveZeroes(nums)
# print(nums)

from tools import *

@exectime(100000)
def moveZeroes(nums):
    """
    Do not return anything, modify nums in-place instead.
    """
    i = 0
    length = len(nums)
    zero_num = 0
    while i < length:
        if nums[i] == 0:
            del nums[i]
            zero_num += 1
            length -= 1
            continue
        i += 1
    nums += [0] * zero_num


nums = [0,0,1]
moveZeroes(nums)
